Description: 旅行商问题的算法，采用分枝限界。网上都只有算法描述，没有实现，这里给出了完整实现，并封装成1个类。-TSP algorithm used Branch and Bound. Only online algorithm description, failed to materialize here is the realization of complete, and packaged as a category. Platform: |
Size: 2048 |
Author:赵刚 |
Hits:
Description: 物流分析工具包。Facility location: Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated facility location
Vehicle routing: VRP, VRP with time windows, traveling salesman problem (TSP)
Networks: Shortest path, min cost network flow, minimum spanning tree problems
Geocoding: U.S. city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting
Layout: Steepest descent pairwise interchange (SDPI) heuristic for QAP
Material handling: Equipment selection
General purpose: Linear programming using the revised simplex method, mixed-integer linear programming (MILP) branch and bound procedure
Data: U.S. cities with populations of at least 10,000, U.S. highway network (Oak Ridge National Highway Network), U.S. 3- and 5-digit ZIP codes -logistics analysis tool kit. Facility location : Continuous minisum facility location, alternate location-allocation (ALA) procedure, discrete uncapacitated Vehicle routing facility location : VRP, VRP with time windows, the traveling salesman problem (TSP) Networks : Shortest path, min cost network flow, minimum spanning tree Geocoding problems : world city or ZIP code to longitude and latitude, longitude and latitude to nearest city, Mercator projection plotting Layout : Steepest descent Pairwise interchange (Constituencies) heuristic for QAP Material handling : Equipment selection General purpose : Linear programming using the revised simplex method, mixed-integer linear programming programming (MILP) branch and bound procedure Data : world cities with populations of at least 10,000, U. Platform: |
Size: 4853760 |
Author:陈宝文 |
Hits:
Search - matlab branch and bound for TSP